Evaluation of Non-Coherent Demodulation of Pi/8 D8PSK with Reed - Solomon Codes
نویسندگان
چکیده
Errors occur after the transmission, because of noise and intervention in communication channels. Protecting digital information is very important with a suitable error-control code that enables the efficient detection and correction of any errors that may have occurred. Error-control codes are now used in the entire range of communication. New types of codes, called Reed –Solomon have been developed. In this paper the reed–solomon codes in conjunction with noncoherent Demodulation of Pi/8 D8PSK is proposed. RS codes are simulated using Pi/8 D8PSK using MATLAB.
منابع مشابه
A general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملCounting generalized Reed-Solomon codes
In this article we count the number of [n, k] generalized Reed– Solomon (GRS) codes, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of [n, 3] MDS codes with n = 6, 7, 8, 9.
متن کاملMultiuser demodulation and iterative decoding for frequency-hopped networks
Demodulation and decoding for frequency-hopped spread-spectrum multiple-access (FH/SSMA) systems have been traditionally conducted by conventional single-user (noncollaborative) demodulation and errors and erasures correcting decoding techniques. In this paper, we study the demodulation and decoding aspects of collaborative multiuser reception for FH/SSMA and propose methods which increase the ...
متن کاملExplicit Deep Holes of Reed-Solomon Codes
In this paper, deep holes of Reed-Solomon (RS) codes are studied. A new class of deep holes for generalized affine RS codes is given if the evaluation set satisfies certain combinatorial structure. Three classes of deep holes for projective Reed-Solomon (PRS) codes are constructed explicitly. In particular, deep holes of PRS codes with redundancy three are completely obtained when the character...
متن کاملSkew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such dist...
متن کامل